Imprimitivity of locally finite, 1-ended, planar graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamilton Cycles in Planar Locally Finite Graphs

A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable concept of an infinite cycle. Such a concept was provided by Diestel and Kühn, who defined circles to be homeomorphic images of the unit circle in the Freudenthal compactification of the (locally finite) graph. With this...

متن کامل

Enumerating planar locally finite Cayley graphs

We characterize the set of planar locally finite Cayley graphs, and give a finite representation of these graphs by a special kind of finite state automata called labeling schemes. As a result, we are able to enumerate and describe all planar locally finite Cayley graphs of a given degree. This analysis allows us to solve the problem of decision of the locally finite planarity for a word-proble...

متن کامل

On locally finite transitive two - ended digraphs *

Since decades transitive graphs are a topic of great interest. The study of s-edge transitive (undirected) graphs goes back to Tutte [13], who showed that finite cubic graphs cannot be s-edge transitive for s> 5. Weiss [14] proved several years later that the only finite connected s-edge transitive graphs with s = 8 are the cycles. Considering directed graphs the situation is much more involved...

متن کامل

Groups acting on locally finite graphs - a survey of the infinitely ended case -

The study of infinite graphs has many aspects and various connections with other fields. There are the classical graph theoretic problems in infinite settings (see the survey by Thomassen [49]); there are special graph theoretical questions which have no direct analogues for finite graphs, such as questions about ends (see [7], [44] and the monograph [6]); Ramsey graph theory with its connectio...

متن کامل

Finite locally-quasiprimitive graphs

A 1nite graph is said to be locally-quasiprimitive relative to a subgroup G of automorphisms if, for all vertices , the stabiliser in G of is quasiprimitive on the set of vertices adjacent to . (A permutation group is said to be quasiprimitive if all of its non-trivial normal subgroups are transitive.) The graph theoretic condition of local quasiprimitivity is strictly weaker than the condition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ars Mathematica Contemporanea

سال: 2012

ISSN: 1855-3974,1855-3966

DOI: 10.26493/1855-3974.213.fcd